Algorithms for Multi-Criteria Boundary Labeling
نویسندگان
چکیده
منابع مشابه
Algorithms for Multi-Criteria Boundary Labeling
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to one side of the bounding box of P . The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithms find a collection of crossing-free leaders that minimizes the total number ...
متن کاملAlgorithms for Multi-criteria One-Sided Boundary Labeling
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P . The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithm finds a collection of nonintersecting leaders that minimizes the total numbe...
متن کاملMulti-stack Boundary Labeling Problems
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a rectangle R which encloses a set of n sites. Each site is associated with an axis-parallel rectangular label. The main task is to place the labels in distinct positions on the boundary of R, so that they do not overlap, an...
متن کاملDeterministic algorithms for multi-criteria Max-TSP
We present deterministic approximation algorithms for the multi-criteria maximum traveling salesman problem (Max-TSP). Our algorithms are faster and simpler than the existing randomized algorithms. We devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of 1/2k−ε and 1/(4k−2)−ε, respectively, where k is the number of objective functions. For two objectiv...
متن کاملDeterministic Algorithms for Multi-criteria TSP
We present deterministic approximation algorithms for the multi-criteria traveling salesman problem (TSP). Our algorithms are faster and simpler than the existing randomized algorithms. First, we devise algorithms for the symmetric and asymmetric multicriteria Max-TSP that achieve ratios of 1/2k − ε and 1/(4k − 2) − ε, respectively, where k is the number of objective functions. For two objectiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2009
ISSN: 1526-1719
DOI: 10.7155/jgaa.00189